Polish intellectual historian Leszek Kołakowski proposed in the 1960s an innovative, now virtually forgotten, reimagining of a crucial concept in the history of Roman Catholicism: the idea of "Counter-Reformation." Kołakowski's lifelong affinity for early modern Europe's Catholic dissidents led him into dialogue in the era of Vatican II with Tadeusz Mazowiecki, the leader of a movement of young Polish reformers who styled themselves "Catholic socialists." Seeing them as the bedrock of a new Catholic Counter-Reformation, Kołakowski sketched the role he hoped (...) Poland might play in reinventing not only Catholicism, but religious life in the modern world. (shrink)

I argue here that consciousness can be engineered. The claim that functional consciousness can be engineered has been persuasively put forth in regards to first-person functional consciousness; robots, for instance, can recognize colors, though there is still much debate about details of this sort of consciousness. Such consciousness has now become one of the meanings of the term phenomenal consciousness (e.g., as used by Franklin and Baars). Yet, we extend the argument beyond the tradition of behaviorist or functional reductive views (...) on consciousness that still predominate within cognitive science. If Nagel-Chalmers-Block-style non-reductive naturalism about first-person consciousness (h-consciousness) holds true, then, eventually we should be able to understand how such consciousness operates and how it gets produced (this is not the same as bridging the explanatory gap or solving Chalmers’s hard problem of consciousness). If so, the consciousness it involves can in principle be engineered. (shrink)

People can support abstract reasoning by using mental models with spatial simulations. Such models are employed when people represent elements in terms of ordered dimensions (e.g. who is oldest, Tom, Dick, or Harry). We test and find that the process of forming and using such mental models can influence the liking of its elements (e.g. Tom, Dick, or Harry). The presumed internal structure of such models (linear-transitive array of elements), generates variations in processing ease (fluency) when using the model in (...) working memory (see the Symbolic Distance Effect, SDE). Specifically, processing of pairs where elements have larger distances along the order should be easier compared to pairs with smaller distances. Elements from easier pairs should be liked more than elements from difficult pairs (fluency being hedonically positive). Experiment 1 shows that unfamiliar ideographs are liked more when at wider distances and therefore easier to process. Experiment 2 replicates this effect with non-words. Experiment 3 rules out a non-spatial explanation of the effect while Experiments 4 offers a high-powered replication. Experiment 5 shows that the spatial effect spontaneously emerges after learning, even without a task that explicitly focuses on fluency. Experiment 6 employed a shorter array, but yielded no significant results. (shrink)

There is relatively little literature on Indian skepticism, with hardly any monograph on the subject comparable to, e.g., Julia Annas’ and Jonathan Barnes’ The Modes of Scepticism: Ancient Texts and Modern Interpretations, R.J. Hankinson’s The Sceptics: The Arguments of the Philosophers, a series of Richard H. Popkin’s monographs on the history of skepticism, or two recent competing volumes as collective efforts: The Oxford Handbook of Skepticism edited by John Greco and The Cambridge Companion to Ancient Scepticism edited by Richard Bett. (...) Therefore what promises to provide a survey of the skeptical tradition of South Asia should potentially be regarded as a milestone work in the... (shrink)

For given Boolean algebras$\mathbb {A}$and$\mathbb {B}$we endow the space$\mathcal {H}(\mathbb {A},\mathbb {B})$of all Boolean homomorphisms from$\mathbb {A}$to$\mathbb {B}$with various topologies and study convergence properties of sequences in$\mathcal {H}(\mathbb {A},\mathbb {B})$. We are in particular interested in the situation when$\mathbb {B}$is a measure algebra as in this case we obtain a natural tool for studying topological convergence properties of sequences of ultrafilters on$\mathbb {A}$in random extensions of the set-theoretical universe. This appears to have strong connections with Dow and Fremlin’s result stating (...) that there are Efimov spaces in the random model. We also investigate relations between topologies on$\mathcal {H}(\mathbb {A},\mathbb {B})$for a Boolean algebra$\mathbb {B}$carrying a strictly positive measure and convergence properties of sequences of measures on$\mathbb {A}$. (shrink)

An operation on inferential rules, called H-operation, is used to minimize the axiom basis for classical logic.

The principles of the physical patterns of self-organization are numerous, different upon various levels of the scale of complexity. The integrated pattern of the changes going on in a living body indicates an integrated nature of its principle - whatever it might happen to be. Aristotle called this kind of principle „psycho", H. Driesch called it „entelecheia", sociobiolo- gists believe that D N A is the right name for it. The fundamental problem consists in seeing - not just deciding a (...) priori - if the empirical data do require - in a living organism - a single, integrating agency. If such a requirement originates in an illusion, the whole problem is fictitious. If this requirement is well founded, then we must to search for such an agent. (shrink)

The principles of the physical patterns of self-organization are numerous, different upon various levels of the scale of complexity. The integrated pattern of the changes going on in a living body indicates an integrated nature of its principle - whatever it might happen to be. Aristotle called this kind of principle „psycho", H. Driesch called it „entelecheia", sociobiolo- gists believe that D N A is the right name for it. The fundamental problem consists in seeing - not just deciding a (...) priori - if the empirical data do require - in a living organism - a single, integrating agency. If such a requirement originates in an illusion, the whole problem is fictitious. If this requirement is well founded, then we must to search for such an agent. (shrink)

The principles of the physical patterns of self-organization are numerous, different upon various levels of the scale of complexity. The integrated pattern of the changes going on in a living body indicates an integrated nature of its principle - whatever it might happen to be. Aristotle called this kind of principle „psycho", H. Driesch called it „entelecheia", sociobiolo- gists believe that D N A is the right name for it. The fundamental problem consists in seeing - not just deciding a (...) priori - if the empirical data do require - in a living organism - a single, integrating agency. If such a requirement originates in an illusion, the whole problem is fictitious. If this requirement is well founded, then we must to search for such an agent. (shrink)

In the article, the author tries to present what the specificity of the issue should consist of – the One and the Many in the aspect of the philosophy of art. For this purpose, he refers to the thought of H-G. Gadamer and Th. W. Adorno, showing the specificity of the existence of artistic objects and the necessity of the emergence of separate interpretations inscribed in it, which, however, have their source in the possibilitiesoffered by a work of art, and (...) are not an external application of content, with a completely separate specificity of existence. When adapting philosophical content, he tries not to forget about the exemplification coming straight from the world of art. (shrink)

An operation on inferential rules, called H-operation, is used to minimize the axiom basis for classical logic.

A recursive enumerator for a function h is an algorithm f which enumerates for an input x finitely many elements including h(x), f is a k(n)-enumerator if for every input x of length n, h(x) is among the first k(n) elements enumerated by f. If there is a k(n)-enumerator for h then h is called k(n)-enumerable. We also consider enumerators which are only A-recursive for some oracle A. We determine exactly how hard it is to enumerate the Kolmogorov function, which (...) assigns to each string x its Kolmogorov complexity: • For every underlying universal machine U, there is a constant a such that C is k(n)-enumerable only if k(n) ≥ n/a for almost all n. • For any given constant k, the Kolmogorov function is k-enumerable relative to an oracle A if and only if A is at least as hard as the halting problem. • There exists an r.e., Turing-incomplete set A such for every non-decreasing and unbounded recursive function k, the Kolmogorov function is k(n)-enumerable relative to A. The last result is obtained by using a relativizable construction for a nonrecursive set A relative to which the prefix-free Kolmogorov complexity differs only by a constant from the unrelativized prefix-free Kolmogorov complexity. Although every 2-enumerator for C is Turing hard for K, we show that reductions must depend on the specific choice of the 2-enumerator and there is no bound on the quantity of their queries. We show our negative results even for strong 2-enumerators as an oracle where the querying machine for any x gets directly an explicit list of all hypotheses of the enumerator for this input. The limitations are very general and we show them for any recursively bounded function g: • For every Turing reduction M and every non-recursive set B, there is a strong 2-enumerator f for g such that M does not Turing reduce B to f. • For every non-recursive set B, there is a strong 2-enumerator f for g such that B is not wtt-reducible to f. Furthermore, we deal with the resource-bounded case and give characterizations for the class ${\rm S}_{2}^{{\rm P}}$ introduced by Canetti and independently Russell and Sundaram and the classes PSPACE, EXP. • ${\rm S}_{2}^{{\rm P}}$ is the class of all sets A for which there is a polynomially bounded function g such that there is a polynomial time tt-reduction which reduces A to every strong 2-enumerator for g. • PSPACE is the class of all sets A for which there is a polynomially bounded function g such that there is a polynomial time Turing reduction which reduces A to every strong 2-enumerator for g. Interestingly, g can be taken to be the Kolmogorov function for the conditional space bounded Kolmogorov complexity. • EXP is the class of all sets A for which there is a polynomially bounded function g and a machine M which witnesses A ∈ PSPACEf for all strong 2-enumerators f for g. Finally, we show that any strong O(log n)-enumerator for the conditional space bounded Kolmogorov function must be PSPACE-hard if P = NP. (shrink)

In their joint paper entitled The Replication of the Hard Problem of Consciousness in AI and BIO-AI (Boltuc et al. Replication of the hard problem of conscious in AI and Bio- AI: An early conceptual framework 2008), Nicholas and Piotr Boltuc suggest that machines could be equipped with phenomenal consciousness, which is subjective consciousness that satisfies Chalmer’s hard problem (We will abbreviate the hard problem of consciousness as H-consciousness ). The claim is that if we knew the inner workings (...) of phenomenal consciousness and could understand its’ precise operation, we could instantiate such consciousness in a machine. This claim, called the extra-strong AI thesis, is an important claim because if true it would demystify the privileged access problem of first-person consciousness and cast it as an empirical problem of science and not a fundamental question of philosophy. A core assumption of the extra-strong AI thesis is that there is no logical argument that precludes the implementation of H-consciousness in an organic or in-organic machine provided we understand its algorithm. Another way of framing this conclusion is that there is nothing special about H-consciousness as compared to any other process. That is, in the same way that we do not preclude a machine from implementing photosynthesis, we also do not preclude a machine from implementing H-consciousness. While one may be more difficult in practice, it is a problem of science and engineering, and no longer a philosophical question. I propose that Boltuc’s conclusion, while plausible and convincing, comes at a very high price; the argument given for his conclusion does not exclude any conceivable process from machine implementation. In short, if we make some assumptions about the equivalence of a rough notion of algorithm and then tie this to human understanding, all logical preconditions vanish and the argument grants that any process can be implemented in a machine. The purpose of this paper is to comment on the argument for his conclusion and offer additional properties of H-consciousness that can be used to make the conclusion falsifiable through scientific investigation rather than relying on the limits of human understanding. (shrink)

Topic modeling—a text‐mining technique often used to uncover thematic structures in large collections of texts—has been increasingly frequently used in the context of the analysis of scholarly output. In this study, we construct a corpus of 19,488 texts published since 1971 in seven leading journals in the field of bioethics and philosophy of medicine, and we use a machine learning algorithm to identify almost 100 topics representing distinct themes of interest in the field. On the basis of intertopic correlations, we (...) group the content‐based topics into eight clusters, thus providing a novel, fine‐grained intellectual map of bioethics and philosophy of medicine. Moreover, we conduct a number of diachronic analyses, examining how the “prominence” of different topics has changed across time. In this way, we are able to observe the distinct patterns in which bioethics and philosophy of medicine have evolved and changed their focus over the past half a century. (shrink)

Predictive processing (PP) has been repeatedly presented as a unificatory account of perception, action, and cognition. In this paper, we argue that this is premature: As a unifying theory, PP fails to deliver general, simple, homogeneous, and systematic explanations. By examining its current trajectory of development, we conclude that PP remains only loosely connected both to its computational framework and to its hypothetical biological underpinnings, which makes its fundamentals unclear. Instead of offering explanations that refer to the same set of (...) principles, we observe systematic equivocations in PP‐based models, or outright contradictions with its avowed principles. To make matters worse, PP‐based models are seldom empirically validated, and they are frequently offered as mere just‐so stories. The large number of PP‐based models is thus not evidence of theoretical progress in unifying perception, action, and cognition. On the contrary, we maintain that the gap between theory and its biological and computational bases contributes to the arrested development of PP as a unificatory theory. Thus, we urge the defenders of PP to focus on its critical problems instead of offering mere re‐descriptions of known phenomena, and to validate their models against possible alternative explanations that stem from different theoretical assumptions. Otherwise, PP will ultimately fail as a unified theory of cognition. (shrink)

Samuel J. Wheeler defends Wittgenstein's criticism of Cantor's set theory against the objections raised by Hilary Putnam. Putnam claims that Wittgenstein's dismissal of the basic tenets of this set theory concerning the noncountability of the set of real numbers was unfounded and ill‐conceived. In Wheeler's view, Putnam's charges result from his failure to grasp Wittgenstein's intention and, in particular, to consider the difference between empirical and logical impossibility. In my paper, I argue that Wheeler's defence is unsuccessful and, at the (...) same time, that Putnam's objections go too far. (shrink)

Citizen identification systems (known also as ‘ID card systems’, or ‘national identity management systems’, even though those definitions are not identical) are receiving a mixed acceptance, with their privacy, security and usability being criticised, specifically in the UK. This paper investigates whether it is possible to improve social acceptance of such systems in cases where they are incompatible with the perceived value of privacy, but without significantly changing their original architecture. The paper analyses requirements using four different scenarios that address (...) long-term privacy issues. Relatively small alterations to such systems are suggested that may significantly improve their adoption. (shrink)

The widespread idea that infinitesimals were “eliminated” by the “great triumvirate” of Cantor, Dedekind, and Weierstrass is refuted by an uninterrupted chain of work on infinitesimal-enriched number systems. The elimination claim is an oversimplification created by triumvirate followers, who tend to view the history of analysis as a pre-ordained march toward the radiant future of Weierstrassian epsilontics. In the present text, we document distortions of the history of analysis stemming from the triumvirate ideology of ontological minimalism, which identified the continuum (...) with a single number system. Such anachronistic distortions characterize the received interpretation of Stevin, Leibniz, d’Alembert, Cauchy, and others. (shrink)

As shown in (Łukowski, Gensler, 2013), the paradox of the stone is a failed attempt to show that “omnipotence” is a contradictory concept. An element of the argument presented there is that God, while unable to lift the stone, can nevertheless annihilate it. This work considers the amplification of the paradox of the stone to the form generated by the question: can God create a stone which He will not be able to lift, nor, once created, will He be able (...) to destroy. (shrink)

The article presents a thought experiment aimed at indicating a possibility for thinking education beyond the logic of progress. In its first part, the argument reconstructs the entanglement of the modern idea of progress (as found in Francis Bacon and Comenius) and education, while tracking down the specific coupling of obedience and conquest at work. Through such an analysis a link between the ideas of progress and of emancipation is determined, which leads to the acknowledgement of the difficulty of the (...) task of imagining education outside of the logic of progress. In the second part an attempt is made to match this task by suggesting that when studying with a teacher, the logic of progress is deactivated. A phenomenological analysis of the practices involved in studying with a teacher points to a specific way of living together that such a collective study involves. This way of living together is formed by continual exercises in the humble equality realized through shared attention to something worthy of study: this stems from attentiveness to what exists, and it develops an attitude of care and respect for being as such. (shrink)